Constructing new families of transmission irregular graphs
نویسندگان
چکیده
The transmission of a vertex v graph G is the sum distances from to all other vertices in . A irregular if its have pairwise different transmissions. starlike tree T ( k 1 , … t ) obtained by attaching an isolated pendant paths lengths respectively. It proved that + ? 2 odd order, then it irregular. ? 3 and only ? { r : } Additional infinite families among trees bi-starlike are determined. Transmission unicyclic also presented, particular, line even.
منابع مشابه
Neighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملNew Families of Mean Graphs
Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment f : V (G) → {1, 2, 3, . . . , p + q} be an injection. For a vertex labeling f, the induced Smarandachely edge m-labeling f S for an edge e = uv, an integer m ≥ 2 is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f(e) : e ∈ E(G)} = {1, 2, 3, ....
متن کاملneighbourly irregular derived graphs
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.10.025